A Complete Abstract Interpretation Framework for Coverability Properties of WSTS
نویسندگان
چکیده
We present an abstract interpretation based approach to solve the coverability problem of well-structured transition systems. Our approach distinguishes from other attempts in that (1) we solve this problem for the whole class of well-structured transition systems using a forward algorithm. So, our algorithm has to deal with possibly infinite downward closed sets. (2) Whereas other approaches have a non generic representation for downward closed sets of states, which turns out to be hard to devise in practice, we introduce a generic representation requiring no additional effort of implementation.
منابع مشابه
Forward Analysis for WSTS, Part III: Karp-Miller Trees
This paper is a sequel of “Forward Analysis for WSTS, Part I: Completions” [STACS 2009, LZI Intl. Proc. in Informatics 3, 433–444] and “Forward Analysis for WSTS, Part II: Complete WSTS” [Logical Methods in Computer Science 8(3), 2012]. In these two papers, we provided a framework to conduct forward reachability analyses of WSTS, using finite representations of downwardsclosed sets. We further ...
متن کاملMaster subject Model Checking Petri Nets Supervisor
The theory of Well Structured Transition Systems, (WSTS) allows the automatical verification of safety properties of infinite-state systems, such that parts of reachability sets can be finitely represented [7, 11, 10]. Termination, boundedness and coverability are decidable for WSTS [4, 5, 9]. As Petri nets are WSTS, the previous properties are decidable. For complete WSTS [10], the Karp and Mi...
متن کاملReachability in Petri
The theory of Well Structured Transition Systems, (WSTS) allows the automatical verification of safety properties of infinite-state systems, such that parts of reachability sets can be finitely represented [7, 11, 10]. Termination, boundedness and coverability are decidable for WSTS [4, 5, 9]. As Petri nets are WSTS, the previous properties are decidable. For complete WSTS [10], the Karp and Mi...
متن کاملExpand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS
In this paper, we present a general algorithmic schema called ‘Expand, Enlarge and Check’ from which new algorithms for the coverability problem of WSTS can be constructed. We show here that our schema allows us to define forward algorithms that decide the coverability problem for several classes of systems for which the Karp and Miller procedure cannot be generalized, and for which no complete...
متن کاملComparing Petri Data Nets and Timed Petri Nets
Well-Structured Transitions Systems (WSTS) constitute a generic class of infinite-state systems for which several properties like coverability remain decidable. The family of coverability languages that they generate is an appropriate criterium for measuring their expressiveness. Here we establish that Petri Data nets (PDNs) and Timed Petri nets (TdPNs), two powerful classes of WSTS are equival...
متن کامل